Probability in the Engineering and Informational Sciences
نویسندگان
چکیده
Motivated by non-Poisson stochastic variability found in service system arrival data, we extend established service system staffing algorithms using the square-root staffing formula to allow for non-Poisson arrival processes. We develop a general model of the non-Poisson non-stationary arrival process that includes as a special case the non-stationary Cox process (a modification of a Poisson process in which the rate itself is a non-stationary stochastic process), which has been advocated in the literature. We characterize the impact of the non-Poisson stochastic variability upon the staffing through the heavy-traffic limit of the peakedness (ratio of the variance to the mean in an associated stationary infinite-server queueing model), which depends on the arrival process through its central limit theorem behavior. We provide simple formulas to quantify the performance impact of the non-Poisson arrivals upon the staffing decisions, in order to achieve the desired service level. We conduct simulation experiments with non-stationary Markov-modulated Pois-son arrival processes with sinusoidal arrival rate functions to demonstrate that the staffing algorithm is effective in stabilizing the time-varying probability of delay at designated targets.
منابع مشابه
Infinite-server Queues with System's Additional Tasks and Impatient Customers
Probability in the Engineering and Informational Sciences / Volume 22 / Issue 04 / October 2008, pp 477 493 DOI: 10.1017/S0269964808000296, Published online: 25 September 2008 Link to this article: http://journals.cambridge.org/abstract_S0269964808000296 How to cite this article: Eitan Altman and Uri Yechiali (2008). INFINITE-SERVER QUEUES WITH SYSTEM'S ADDITIONAL TASKS AND IMPATIENT CUSTOMERS....
متن کاملTime stochastic s-convexity of claim processes
The purpose of this paper is to study the conditions on a stochastic process under which the s-convex ordering and the s-increasing convex stochastic ordering between two random instants is transformed into a stochastic ordering of the same type between the states occupied by this process at these moments. In this respect, the present work develops a previous study by Shaked and Wong (1995) [Pr...
متن کاملOn the Assignment of Customers to Parallel Queues
This paper considers routing to parallel queues in which each queue has its own single server, and service times are exponential with nonidentical parameters. We give conditions on the cost function such that the optimal policy assigns customers to a faster queue when that server has a shorter queue. The queues may have finite buffers, and the arrival process can be controlled and can depend on...
متن کاملA generalized coupon collecting model as a parsimonious optimal stochastic assignment model
1 Sheldon M. Ross is the Daniel Epstein Chair professor in the Department of Industrial and Systems Engineering at the University of Southern California. He received his Ph.D. in statistics at Stanford University in 1968 and he served as a Professor at the University of California, Berkeley from 1976 until 2004. Dr. Ross is the author of Introduction to Mathematical Finance: Options and Other T...
متن کاملEntropy-based Serviceability Assessment of Water Distribution Networks, Subjected to Natural and Man-Made Hazards
In this study a modified entropy-based measure is presented for evaluating the serviceability level of water distribution networks in which the hydraulic uncertainties (flow rates in pipes) as well as the uncertainties due to mechanical parameters (failure probabilities of links) are considered simultaneously. In the proposed entropy calculation method, the connectivity order of the network dem...
متن کامل